Synthesizing Interacting Finite State Machines
نویسندگان
چکیده
We present a mathematical framework for analyzing the synthesis of interacting finite state systems. The logic S1S is used to derive simple, rigorous, and constructive solutions to problems in sequential synthesis. We obtain exact and approximate sets of permissible FSM network behavior, and address the issue of FSM realizability. This approach is also applied to synthesizing systems with fairness and timed systems.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملDecision problems for interacting finite state machines
Given a system of n interacting finite state machines (FSM’s) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. We investigate the complexity of this decision problem and three of its derivatives, namely l) verifying system determinism, 2) testing for the existence of unspecified inputs to any FSM within the system, and ...
متن کاملCompositional Software Synthesis of Communicating Processes
In this paper, we describe a new compositional software synthesis method for synthesizing concurrent software programs into ordinary C programs so that they can be executed on embedded processors without the need for a run-time multitasking operating system. The synthesized C program can be readily retargeted to different processors using available optimizing C compilers. The method works by tr...
متن کاملAutomatic Synthesis of Timed Protocol Specifications from Service Specifications
Several methods have been proposed for synthesizing computer communication protocol specifications from service specifications. In real time applications, the time required to execute the events can be crucial and has to be considered. Some of the protocol synthesis methods do not consider timing constraints and, therefore, cannot be used in real time applications. In this paper, the assignment...
متن کاملFinite State Machine Synthesis with Fault Tolerant Test hnction
In a recent proposal a test function, which is a finite state machine with the same number of state variables as the given object machine, is incorporated into the state diagram of the object machine. Since a complete verification of the test machine ss impractical, an often used heuristic sets and observes each state variable. As the two machines share logic, a fault can reeult in partial or t...
متن کامل